Closed-Form Maximum Likelihood Estimates of Nearest Neighbor Spatial Dependence
نویسندگان
چکیده
منابع مشابه
Closed-Form Maximum Likelihood Estimates for Spatial Problems
This manuscript introduces the matrix exponential as a way of specifying spatial transformations of the data. The matrix exponential spatial specification (MESS) simplifies the log-likelihood, leading to a closed form maximum likelihood solution. The computational advantages of this model make it ideal for applications involving large data sets such as census and real estate data. The manuscrip...
متن کاملClosed Form Maximum Likelihood Estimator Of Conditional Random Fields
Training Conditional Random Fields (CRFs) can be very slow for big data. In this paper, we present a new training method for CRFs called Empirical Training which is motivated by the concept of co-occurrence rate. We show that the standard training (unregularized) can have many maximum likelihood estimations (MLEs). Empirical training has a unique closed form MLE which is also a MLE of the stand...
متن کاملA Closed-Form Constraint Networks Solver for Maximum Likelihood Mapping
Maximum likelihood mapping is one of the approaches applied to simultaneous localization and mapping problems. According to such formulation map estimation corresponds to the configuration that maximizes the likelihood associated to a constraint network representing the map. Several efficient iterative fixed-point techniques have been proposed to solve this optimization problem in practice, but...
متن کاملMolecular clock fork phylogenies: closed form analytic maximum likelihood solutions.
Maximum likelihood (ML) is increasingly used as an optimality criterion for selecting evolutionary trees, but finding the global optimum is a hard computational task. Because no general analytic solution is known, numeric techniques such as hill climbing or expectation maximization (EM) are used in order to find optimal parameters for a given tree. So far, analytic solutions were derived only f...
متن کاملMaximum-likelihood approximate nearest neighbor method in real-time image recognition
We explore the problems of classification of composite object (images, speech signals) with low number of models per class. We study the question of improving recognition performance for medium-sized database (thousands of classes). The key issue of fast approximate nearest-neighbor methods widely applied in this task is their heuristic nature. It is possible to strongly prove their efficiency ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geographical Analysis
سال: 2010
ISSN: 0016-7363
DOI: 10.1111/j.1538-4632.2000.tb00422.x